Concepedia

Concept

traveling salesman problem

Parents

2.9K

Publications

238.7K

Citations

5.5K

Authors

1.8K

Institutions

About

Traveling salesman problem is a seminal problem in combinatorial optimization and theoretical computer science. It investigates finding the shortest possible tour that visits every city exactly once and returns to the starting point. Its significance stems from its NP-hard complexity, making it a critical benchmark for developing and evaluating algorithms for discrete optimization and computational complexity theory.

Top Authors

Rankings shown are based on concept H-Index.

GL

HEC Montréal

MG

Université de Montréal

BG

University of Maryland, College Park

JS

Universidad de La Laguna

PT

University of Bologna

Top Institutions

Rankings shown are based on concept H-Index.

HEC Montréal

Montreal, Canada

Université de Montréal

Montreal, Canada

University of Bologna

Bologna, Italy

University of Maryland, College Park

College Park, United States